Vertex Ranking of Asteroidal Triple-Free Graphs
نویسندگان
چکیده
We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. lts running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.
منابع مشابه
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
Asteroidal Triple-free (AT-free) graphs have received considerable attention due to their inclusion of various important graphs families, such as interval and cocomparability graphs. The asteroidal number of a graph is the size of a largest subset of vertices such that the removal of the closed neighbourhood of any vertex in the set leaves the remaining vertices of the set in the same connected...
متن کاملPowers of Asteroidal Triple-free Graphs with Applications
An asteroidal triple is an independent set of three vertices in a graph such that every two of them are joined by a path avoiding the closed neighborhood of the third. Graphs without asteroidal triples are called AT-free graphs. In this paper, we show that every AT-free graph admits a vertex ordering that we call a 2-cocomparability ordering. The new suggested ordering generalizes the cocompara...
متن کاملAsteroidal Triple-Free Graphs
An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common generalization of interval, permutation, trapezoid...
متن کاملAsteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland. Their result says that a chordal graph is an interval graph if and only if it contains no asteroidal triple. In this paper, we prove a...
متن کاملColouring AT-Free Graphs
A vertex colouring assigns to each vertex of a graph a colour such that adjacent vertices have different colours. The algorithmic complexity of the Colouring problem, asking for the smallest number of colours needed to vertex-colour a given graph, is known for a large number of graph classes. Notably it is NP-complete in general, but polynomial time solvable for perfect graphs. A triple of vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 68 شماره
صفحات -
تاریخ انتشار 1996